Visual vehicle Tracking is an important topic in intelligent transportation systems. Intersections are challenging locations for visual systems to track vehicles which are simultaneously moving in different directions. In addition, normal traffic flow may change at Intersections due to accidents. Congestion, occlusion and undetermined motion flows are the nominated challenging issues of vehicle Tracking at Intersections. In this paper, a method for Tracking multiple vehicles is proposed considering the vehicle motion directions to overcome undetermined motion flows. For this purpose, a multilayer model is presented, which assigns each motion flows to distinct layers. Moreover, we introduce different neighborhoods for various layers considering the regular motion flows in a layer. Hence, vehicles entering from the same side of Intersection with the same motion direction are assigned to the same layer. Then the Tracking is performed on different layers separately. In special cases such as vehicles crossing each other, misdetections or occlusion, the proposed Tracking method can predict the vehicles tracks by using the stored Tracking history and considering neighborhoods in that layer. Experimental results show consistency between proposed Tracking method results and ground truth, also outperformance of other Tracking methods in Tracking vehicles crossing the Intersection.

In today's world, we are witnessing the launch, maintenance, control and exploitation of various projects. Projects that have high costs and optimal use of this capital in the current economy of the country are highly regarded by managers. On the other hand, each project is expected to achieve its predetermined goals at a specified time. Today, the necessity of rapid construction of subway lines in Tehran's metropolitan area, which is involved in severe traffic jams, is not covered by anyone. Despite the understanding of this issue by the authorities and the good actions taken so far in this direction. However, more effort and a greater determination to reach the acceptable speed in the construction and completion of metro lines is necessary. Quick implementation of projects is based on the principles of concurrent engineering, called fast Tracking, in construction projects. In the fast delivery method, solutions such as resource enhancement, synchronous engineering, overlapping phases, value engineering, teamwork by the multi-functional team, improving communication and information transfer, and accelerating decision making, using efficient contractual methods (transferring risks as Effective way, which by using the correct methods, accelerates the implementation of the project. Therefore, in this article, management strategies for implementing fast Tracking projects in the development projects of the country have been investigated.

The comaximal Intersection graph $CI(R)$ of ideals of a ring $R$ is an undirected graph whose vertex set is the collection of all non-trivial (left) ideals of $R$ and any two vertices $I$ and  $J$ are adjacent if and only if $I+J=R$ and $I\cap J\neq0$. We study the connectedness of $CI(R)$. We also discuss  independence number, clique number, domination number, chromatic number of $CI(R)$.

For any non-empty set and k-subset  , the k-Intersection graph denoted by 􀀀 m(;  ) is undirected simple graph whose vertices are all m-subsets of and two distinct vertices A and B are adjacent if and only if A \ B *  . In this paper, we determine diameter, girth, some numerical invariants and planarity, hamiltonian and perfect matching of these graphs. Moreover adjacency matrix is considered at the end.

Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for matching function of Boolean retrieval systems is proposed and tried to extend postings list data structures and increase the efficiency of using postings lists and skips. The final effect of these considerations is in decreasing the search time.

Let G be a finite group with the identity e. The subgroup Intersection graph  GSI (G) of G is the graph with vertex set V (GSI (G)) =G-e and two distinct vertices x and y are adjacent in GSI (G) if and only if |áxñՈáyñ|>1, where áxñ is the cyclic subgroup of G generated by xÎG. In this paper, we obtain a lower bound for the independence number of subgroup Intersection graph. We characterize certain classes of subgroup Intersection graphs corresponding to finite abelian groups. Finally, we characterize groups whose automorphism group is the same as that of its subgroup Intersection graph.